Inverse Bernstein Inequalities and Min-max-min Problems on the Unit Circle
نویسندگان
چکیده
We give a short and elementary proof of an inverse Bernsteintype inequality found by S. Khrushchev for the derivative of a polynomial having all its zeros on the unit circle . The inequality is used to show that equally-spaced points solve a min-max-min problem for the logarithmic potential of such polynomials. Using techniques recently developed for polarization (Chebyshev-type) problems, we show that this optimality also holds for a large class of potentials, including the Riesz potentials 1/r with s > 0. 1. Inverse Bernstein-type inequality Inequalities involving the derivatives of polynomials often occur in approximation theory (see, e.g. [4], [6]). One of the most familiar of these inequalities is due to Bernstein which provides an upper bound for the derivative of a polynomial on the unit circle T of the complex plane. In [9], S. Khrushchev derived a rather striking inverse Bernstein-type inequality, a slight improvement of which may be stated as follows.
منابع مشابه
Markov-bernstein Type Inequalities for Constrained Polynomials with Real versus Complex Coefficients
Let Pc n,k denote the set of all polynomials of degree at most n with complex coefficients and with at most k (0 ≤ k ≤ n) zeros in the open unit disk. Let Pn,k denote the set of all polynomials of degree at most n with real coefficients and with at most k (0 ≤ k ≤ n) zeros in the open unit disk. Associated with 0 ≤ k ≤ n and x ∈ [−1, 1], let B∗ n,k,x := max 8< : s n(k + 1) 1 − x2 , n log e 1 − ...
متن کاملRESOLUTION OF NONLINEAR OPTIMIZATION PROBLEMS SUBJECT TO BIPOLAR MAX-MIN FUZZY RELATION EQUATION CONSTRAINTS USING GENETIC ALGORITHM
This paper studies the nonlinear optimization problems subject to bipolar max-min fuzzy relation equation constraints. The feasible solution set of the problems is non-convex, in a general case. Therefore, conventional nonlinear optimization methods cannot be ideal for resolution of such problems. Hence, a Genetic Algorithm (GA) is proposed to find their optimal solution. This algorithm uses th...
متن کاملSome inverse min-max network problems under weighted l1 and linfinity norms with bound constraints on changes
We consider some inverse min-max (or max-min) network problems. Such an inverse problem is to modify the weights with bound constraints so that a given feasible solution becomes an optimal solution of a min-max (or max-min) network problem, and the deviation of the weights, measured by the weighted l1 norm or weighted l∞ norm, is minimum. In this paper, we present strongly polynomial time algor...
متن کاملMax-Min averaging operator: fuzzy inequality systems and resolution
Minimum and maximum operators are two well-known t-norm and s-norm used frequently in fuzzy systems. In this paper, two different types of fuzzy inequalities are simultaneously studied where the convex combination of minimum and maximum operators is applied as the fuzzy relational composition. Some basic properties and theoretical aspects of the problem are derived and four necessary and suffi...
متن کاملBernstein and Markov type inequalities for trigonometric polynomials on general sets∗
Bernstein and Markov-type inequalities are discussed for the derivatives of trigonometric and algebraic polynomials on general subsets of the real axis and of the unit circle. It has recently been proven by A. Lukashov that the sharp Bernstein factor for trigonometric polynomials is the equilibrium density of the image of the set on the unit circle under the mapping t → e. In this paper Lukasho...
متن کامل